ILP-based multiperiod flow routing and scheduling method in time-sensitive network

Abstract Time-sensitive network (TSN) provides end-to-end data transfer with very low latency and high reliability on the basis of Ethernet. It is suitable for time-sensitive applications will be widely used in scenarios such as autonomous driving industrial Internet. When existing flow routing scheduling methods do not consider shared bandwidth triggered by different cycle times, possibility conflict different, which leads to inaccuracy index measure bottleneck. This paper analyses between conflict, puts forward a kind applicable passes based integer linear programming traffic algorithm, according characteristics carries preliminary classification sorting, developed series constraints, implementation sensitive time packet scheduling. The experiment can conducted from three perspectives average delay, maximum load, proposed method was compared benchmark algorithm evaluation. results show that significantly improve capacity flow, reduce load optimizing bottleneck at same time, schedulability.